Connectivity and diameter in distance graphs
نویسندگان
چکیده
منابع مشابه
Connectivity and diameter in distance graphs
For n ∈ N and D ⊆ N, the distance graph P n has vertex set {0, 1, . . . , n− 1} and edge set {ij | 0 ≤ i, j ≤ n − 1, |j − i| ∈ D}. The class of distance graphs generalizes the important and very well-studied class of circulant graphs which have been proposed for numerous network applications. In view of fault tolerance and delay issues in these applications, the connectivity and diameter of cir...
متن کاملEigenvalues, diameter, and mean distance in graphs
It is well-known that the second smallest eigenvalue 22 of the difference Laplacian matrix of a graph G is related to the expansion properties of G. A more detailed analysis of this relation is given. Upper and lower bounds on the diameter and the mean distance in G in terms of 22 are derived.
متن کاملDiameter and connectivity of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a given graph G, X(G), is defined to have vertices the arcs of G. Two arcs uv, xy are adjacent in X(G) if and only if (v, u, x, y) is a 3-arc of G. This notion was introduced in recent studies of arc-transitive graphs. In this...
متن کاملDistance and connectivity measures in permutation graphs
A permutation graph G of a graph G (or generalized prism) is obtained by taking two disjoint copies of G and adding an arbitrary matching between the copies. For the parameters diameter, radius, average distance, connectivity and edge-connectivity, we compare the values of the parameter for G and G. In particular we show that if G has no isolates and is not 2Kk for k odd, then there exists a pe...
متن کاملDistance connectivity in graphs and digraphs
Let G = (V, A) be a digraph with diameter D 6= 1. For a given integer 2 ≤ t ≤ D, the t-distance connectivity κ(t) of G is the minimum cardinality of an x → y separating set over all the pairs of vertices x, y which are at distance d(x, y) ≥ t. The t-distance edge connectivity λ(t) of G is defined similarly. The t-degree of G, δ(t), is the minimum among the out-degrees and in-degrees of all vert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2010
ISSN: 0028-3045
DOI: 10.1002/net.20397